Learning Partial Lexicographic Preference Trees over Combinatorial Domains
نویسندگان
چکیده
We introduce partial lexicographic preference trees (PLPtrees) as a formalism for compact representations of preferences over combinatorial domains. Our main results concern the problem of passive learning of PLP-trees. Specifically, for several classes of PLP-trees, we study how to learn (i) a PLPtree consistent with a dataset of examples, possibly subject to requirements on the size of the tree, and (ii) a PLP-tree correctly ordering as many of the examples as possible in case the dataset of examples is inconsistent. We establish complexity of these problems and, in all cases where the problem is in the class P, propose polynomial time algorithms.
منابع مشابه
Reasoning with Preference Trees over Combinatorial Domains
Preference trees, or P-trees for short, offer an intuitive and often concise way of representing preferences over combinatorial domains. In this paper, we propose an alternative definition of P-trees, and formally introduce their compact representation that exploits occurrences of identical subtrees. We show that P-trees generalize lexicographic preference trees and are strictly more expressive...
متن کاملLearning Conditional Lexicographic Preference Trees
We introduce a generalization of lexicographic orders and argue that this generalization constitutes an interesting model class for preference learning in general and ranking in particular. We propose a learning algorithm for inducing a so-called conditional lexicographic preference tree from a given set of training data in the form of pairwise comparisons between objects. Experimentally, we va...
متن کاملAggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preferences, or LP trees. We study aggregation problems of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for inst...
متن کاملPreference Trees: A Language for Representing and Reasoning about Qualitative Preferences
We introduce a novel qualitative preference representation language, preference trees, or P-trees. We show that the language is intuitive to specify preferences over combinatorial domains and it extends existing preference formalisms such as LP-trees, ASO-rules and possibilistic logic. We study reasoning problems with P-trees and obtain computational complexity results.
متن کاملLearning conditionally lexicographic preference relations
We consider the problem of learning a user’s ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general graphical representation called LP-trees which captures various natural classes of such preference relations, depending on whether the importance order between attributes and/or the local preferences on the domain of each attribute ...
متن کامل